﻿#include <iostream>
#include <vector>
using namespace std;


class Solution
{
public:
    // 718. 最长重复子数组
    int findLength(vector<int>& nums1, vector<int>& nums2)
    {
        int m = nums1.size(), n = nums2.size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        int ret = 0;
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                if (nums1[i - 1] == nums2[j - 1])
                    dp[i][j] = dp[i - 1][j - 1] + 1, ret = max(ret, dp[i][j]);

        return ret;
    }
};

int main()
{
    vector<int> v1{ 1,2,3,2,1 };
    vector<int> v2{ 3,2,1,4,7 };
    cout << Solution().findLength(v1, v2) << endl;

    return 0;
}